On $\Game \mathbf {\Gamma }$-complete sets

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Omega Rule is $\mathbf{\Pi_{1}^{1}}$-Complete in the $\lambda\beta$-Calculus

In a functional calculus, the so called ω-rule states that if two terms P and Q applied to any closed term N return the same value (i.e. PN = QN), then they are equal (i.e. P = Q holds). As it is well known, in the λβ-calculus the ω-rule does not hold, even when the η-rule (weak extensionality) is added to the calculus. A long-standing problem of H. Barendregt (1975) concerns the determination ...

متن کامل

On the Structure of Complete Sets

The many types of resource bounded reductions that are both object of study and research tool in structural complexity theory have given rise to a large variety of completeness notions. A complete set in a complexity class is a manageable object that represents the structure of the entire class. The study of its structure can reveal properties that are general in that complexity class, and the ...

متن کامل

On P-Immunity of Nondeterministic Complete Sets

We show that every m-complete set for NEXP as well as ats complement have an infinite subset in P. Thw nnswers an open question first raised in [Ber76].

متن کامل

On Non-complete Sets and Restivo's Conjecture

A finite set S of words over the alphabet Σ is called noncomplete if Fact(S∗) 6= Σ∗. A word w ∈ Σ∗ \ Fact(S∗) is said to be uncompletable. We present a series of non-complete sets Sk whose minimal uncompletable words have length 5k − 17k+13, where k ≥ 4 is the maximal length of words in Sk. This is an infinite series of counterexamples to Restivo’s conjecture, which states that any non-complete...

متن کامل

Game-Theoretic Rough Sets

This article investigates the Game-theoretic Rough Set (GTRS) model and its capability of analyzing a major decision problem evident in existing probabilistic rough set models. A major challenge in the application of probabilistic rough set models is their inability to formulate a method of decreasing the size of the boundary region through further explorations of the data. To decrease the size...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 2019

ISSN: 0002-9939,1088-6826

DOI: 10.1090/proc/14731